Tripartite graphs with energy aggregation
نویسندگان
چکیده
منابع مشابه
Tiling Tripartite Graphs with 3-Colorable Graphs
For any positive real number γ and any positive integer h, there is N0 such that the following holds. Let N > N0 be such that N is divisible by h. If G is a tripartite graph with N vertices in each vertex class such that every vertex is adjacent to at least (2/3 + γ)N vertices in each of the other classes, then G can be tiled perfectly by copies of Kh,h,h. This extends the work in [Discrete Mat...
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملSaturation Numbers in Tripartite Graphs
Given graphs H and F , a subgraph G ⊆ H is an F -saturated subgraph of H if F * G, but F ⊆ G + e for all e ∈ E(H) \ E(G). The saturation number of F in H, denoted sat(H,F ), is the minimum number of edges in an F -saturated subgraph of H. In this paper we study saturation numbers of tripartite graphs in tripartite graphs. For ` ≥ 1 and n1, n2, and n3 sufficiently large, we determine sat(Kn1,n2,...
متن کاملChromaticity of certain tripartite graphs identified with a path
For a graphG, let P(G) be its chromatic polynomial. Two graphsG andH are chromatically equivalent if P(G)=P(H). A graph G is chromatically unique if P(H)= P(G) implies that H G. In this paper, we classify the chromatic classes of graphs obtained from K2,2,2 ∪ Pm(m 3), (K2,2,2 − e) ∪ Pm(m 5) and (K2,2,2 − 2e) ∪ Pm(m 6) by identifying the end-vertices of the path Pm with any two vertices of K2,2,...
متن کاملComplete Tripartite Graphs and their Competition Numbers
We present a piecewise formula for the competition numbers of the complete tripartite graphs. For positive integers x, y and z where 2 ≤ x ≤ y ≤ z, the competition number of the complete tripartite graph Kx,y,z is yz − z − y − x + 3 whenever x 6= y and yz − 2y − z + 4 otherwise.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Boletim da Sociedade Paranaense de Matemática
سال: 2019
ISSN: 2175-1188,0037-8712
DOI: 10.5269/bspm.v38i7.44463